Between clique-width and linear clique-width of bipartite graphs
نویسندگان
چکیده
منابع مشابه
Graphs of small bounded linear clique-width
In this paper we give the first characterisation of graphs with linear clique-width at most 3, and we give a polynomial-time recognition algorithm for such graphs. In addition, we give a new characterisation of graphs with linear clique-width at most 2 and a new layout characterisation of linear clique-width in general. Among our results is also a decomposition scheme that preserves the linear ...
متن کاملMinimal forbidden induced subgraphs of graphs of bounded clique-width and bounded linear clique-width
In the study of full bubble model graphs of bounded clique-width and bounded linear clique-width, we determined complete sets of forbidden induced subgraphs, that are minimal in the class of full bubble model graphs. In this note, we show that (almost all of) these graphs are minimal in the class of all graphs. As a corollary, we can give sets of minimal forbidden induced subgraphs for graphs o...
متن کاملChordal bipartite graphs of bounded tree- and clique-width
A bipartite graph is chordal bipartite if every cycle of length at least six has a chord. In the class of chordal bipartite graphs the tree-width and the clique-width are unbounded. Our main results are that chordal bipartite graphs of bounded vertex degree have bounded tree-width and that k-fork-free chordal bipartite graphs have bounded clique-width, where a k-fork is the graph arising from a...
متن کاملClassifying the Clique-Width of H-Free Bipartite Graphs
Let G be a bipartite graph, and let H be a bipartite graph with a fixed bipartition (BH ,WH). We consider three different, natural ways of forbidding H as an induced subgraph in G. First, G is H-free if it does not contain H as an induced subgraph. Second, G is strongly H-free if G is H-free or else has no bipartition (BG,WG) with BH ⊆ BG and WH ⊆ WG. Third, G is weakly H-free if G is H-free or...
متن کاملThe Clique-Width of Bipartite Graphs in Monogenic Classes
In this paper, we provide complete classification of classes of bipartite graphs defined by a single forbidden induced bipartite subgraph with respect to bounded/unbounded clique-width.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2020
ISSN: 0012-365X
DOI: 10.1016/j.disc.2020.111926